Zero divisors for matrices over commutative semirings

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On idempotent matrices over semirings

Idempotent matrices play a significant role while dealing with different questions in matrix theory and its applications. It is easy to see that over a field any idempotent matrix is similar to a diagonal matrix with 0 and 1 on the main diagonal. Over a semiring the situation is quite different. For example, the matrix J of all ones is idempotent over Boolean semiring. The first characterizatio...

متن کامل

Idempotent Subreducts of Semimodules over Commutative Semirings

A short proof of the characterization of idempotent subreducts of semimodules over commutative semirings is presented. It says that an idempotent algebra embeds into a semimodule over a commutative semiring, if and only if it belongs to the variety of Szendrei modes.

متن کامل

Convergence of Newton's Method over Commutative Semirings

We give a lower bound on the speed at which Newton’s method (as defined in [5, 6]) converges over arbitrary ω-continuous commutative semirings. From this result, we deduce that Newton’s method converges within a finite number of iterations over any semiring which is “collapsed at some k ∈ N” (i.e. k = k + 1 holds) in the sense of [1]. We apply these results to (1) obtain a generalization of Par...

متن کامل

Zero-divisor Graphs of Matrices over Commutative Rings

The concept of a zero-divisor graph of a commutative ring was first introduced in Beck (1988), and later redefined in Anderson and Livingston (1999). Redmond (2002) further extended this concept to the noncommutative case, introducing several definitions of a zero-divisor graph of a noncommutative ring. Recently, the diameter and girth of polynomial and power series rings over a commutative rin...

متن کامل

On Fixed Point Equations over Commutative Semirings

Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f(0), . . . converges to the least fixed point μf . The convergence can be accelerated if the underlying semiring is commutative. We show that accelerations in the literature, namely Newton’s method for the arithmetic semiring [4] and a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ScienceAsia

سال: 2016

ISSN: 1513-1874

DOI: 10.2306/scienceasia1513-1874.2016.42.362